Method for generating 2D OVSF codes in multicarrier DS-CDMA systems

ABSTRACT

A code tree of two-dimensional orthogonal variable spreading factor (2D-OVSF) code matrices for a multicarrier direct-sequence code-division multiple-access (MC-DS/CDMA) communications system is generated by providing two sets of 2×2 orthogonal matrices {A (1)   (2×2),  A (2)   (2×2) } and {B (1)   (2×2),  B (2)   (2×2) }. The first set of 2×2 matrices is used to generate a pair of sibling nodes in the code tree that respectively represent matrices  A     (1)   (2×2 α ) and  A     (2)   (2×2 α ) by iterating the relationship:  
       A     (1)   (2×2 1+β )= [A     (1)   (2×2 β )  A     (2)   (2×2 β ) ],  The matrices  A     (1)   (2×2 α ) and  A     (2)   (2×2 α ) are  
       A     (2)   (2×2 1+β )= [A     (1)   (2×2 β )  −A     (2)   (2×2 β ) ].  used to generate a child node of one of the sibling nodes. The child node contains an M×N matrix, which is found by iterating the relationship:  
       A     (i−1)   (O×P)= [B     (1)   (2×2)   {circle over (×)}     A     (i/2)   (O/2×P/2) ]  where {circle over (×)} indicates a Kronecker product.  
       A     (i)   (O=P)= [B     (2)   (2×2)   {circle over (×)}     A     (i/2)   (O/2×P/2) ],

BACKGROUND OF INVENTION

[0001] 1. Field of the Invention

[0002] The present invention relates to code-division multiple-access (CDMA) communications systems. More specifically, two-dimensional orthogonal variable spreading factor (2D-OVSF) codes for a multicarrier direct-sequence CDMA system are disclosed.

[0003] 2. Description of the Prior Art

[0004] The enormous market penetration of second-generation (2G) mobile communications systems, and the promise of expanded features for these devices, has spurred the demand for transmission/reception strategies that are capable of ever-greater data transmission rates. This has lead to the development of so-called third-generation (3G) mobile communications, such as the 2 Mbps wideband code-division multiple-access (W-CDMA) service proposed by the International Mobile Telecommunications 2000 (IMT-2000) body. CDMA technology is used in 3G mobile communications to provide wideband services in a flexible manner. Through spectrum spreading, CDMA systems offer spectrum reuse, multipath resistance, frequency diversity and interference rejection.

[0005] To support both high-speed and multirate data services, two approaches are used in an IMT-2000 W-CDMA system: variable-length spreading and multicode techniques. Variable-length spreading CDMA uses multiple spreading factors for multirate transmissions, whereas multicode CDMA allocates multiple codes to high data rate services. The two-layered spreading method is used in W-CDMA to provide mutual orthogonality between users of the same cell, while maintaining mutual randomness between users of different cells. The two-layered spreading method has two parts. The first is channelization, which transforms every data symbol into a predetermined number of chips. The number of chips per data symbol is termed the spreading factor. Orthogonal variable spreading factor (OVSF) codes are employed as channelization codes to ensure orthogonality between different downlink channels. The second part is scrambling. Each user in the same cell uses the same scrambling code to provide randomness (or, rather, pseudo-randomness) between users of different cells. However, orthogonal variable spreading factor (OVSF) codes cannot maintain orthogonality among users in the uplink channels. Therefore, users in the same cell use different scrambling codes to provide randomness and orthogonality in uplink channels.

[0006] However, for even greater data transmission capabilities, multicarrier direct-sequence CDMA (MC-DS/CDMA) systems have been proposed. MC-DS/CDMA communications systems using orthogonal spreading codeshave an advantage in that they minimize multiple-access interference (MAI), which is one of the primary sources of Interference in CDMA systems. By reducing MAI, greater transmission data rates are made possible. Each user in a MC-DS/CDMA system is assigned a distinct two-dimensional (2D) spreading code sequence in the form of a matrix, which serves as the signature sequence for the user. The number of columns in the matrix indicates the spreading factor utilized (i.e., the number of chips per data symbol). The number of rows in the matrix indicates the number of frequency carriers in the MC-DS/CDMA system. Each row of the matrix is transmitted along different frequency carriers. It is possible to construct a class of 2D spreading code matrices for MC-DS/CDMA systems that exhibit cyclic autocorrelation sidelobes and cyclic cross-correlation functions that are at most zero at all times. As MAI is primarily the result of non-zero cross-correlation functions of simultaneously transmitting users, by providing such unique spreading code matrices, MAI can be significantly reduced In MC-DS/CDMA communications systems. Please refer to FIG. 1A and FIG. 1B. FIG. 1A is a simple block diagram of a MC-DS/CDMA communications system 10 according to the prior art. FIG. 1B Illustrates an M×N spreading code matrix 14 a utilized by the communications system 10. Input data 12 a feeds into a multiplier 14, which spreads the spectrum through the assignment of unique signature M×N spreading code matrix 14 a. Data after spreading spectrum 15 is then fed into a multicarrier modulation unit 16 and transmitted. On a receiver side, a multicarrier demodulation unit 17 receivers the transmitted signal and demodulates it to generate the demodulated data 18. A multiplier 19 multiplies the data 18 by the same M×N spreading code matrix 14 a to generate output data 12 b. Typically, the M×N spreading code matrices of all users are identical,and ideally the output data 12 b should match the input data 12 a.

[0007] To date, however, MC-DS/CDMA spreading code matrices have been very limited in form, being M×N with the following restrictions:

M=N=2^(k), with k≧1, or  1)

M=2^(k), and N=M², with k≧1.  2)

[0008] This places a corresponding restriction on MC-DS/CDMA communications systems that severely limits the potential flexibility of these systems as regards data transmission parameters.

SUMMARY OF INVENTION

[0009] It is therefore a primary objective of this invention to provide multicarrier direct-sequence code-division multiple-access (MC-DS/CDMA) communications systems that have the ability to generate, and hence use, generalized two-dimensional (2D) orthogonal variable spreading factor (2D-OVSF) codes having the form of an M×N matrix where M=2^(k) and N=2^(l), with l≧k≧1.

[0010] Briefly summarized, the preferred embodiment of the present invention discloses a method for wireless communications. A multicarrier direct-sequence code-division multiple-access (MC-DS/CDMA) communications system is provided. A code tree of two-dimensional orthogonal variable spreading factor (2D-OVSF) codes is then generated for the system. Each node of the code tree has a corresponding matrix that is representative of a spreading code sequence. An M×N matrix from a node of the code tree is selected, where M relates to the number of available frequency carriers in the MC-DS/CDMA system, N relates to a spreading factor code length, M=+B2 ^(k),^(N=2) ^(h+α) ,

[0011] k is greater than zero, and α is greater than or equal to zero. The M×N matrix is then assigned to a user of the MC-DS/CDMA system to serve as a signature sequence of the user. To generate the code tree, two sets of 2×2 orthogonal matrices {A_((2 × 2))⁽¹⁾, A_((2 × 2))⁽²⁾}  and  {B_((2 × 2))⁽¹⁾, B_((2 × 2))⁽²⁾}  

[0012] are provided. The first and second 2×2 matrices are used to generate pairs progenitor nodes in the code tree that respectively represent matrices ^(A) ⁽¹⁾ ^((2×2) ^(α) ⁾ _(,) and ^(A) ⁽²⁾ ^((2×2) ^(α) ⁾ _(,) by iterating the relationship:

^(A(1))(2×2^(1+β))=^([A(1))(2×2^(β)) ^(A(2))(2×2^(β))^(],)

^(A(2))(2×2^(1+β))=^([A(1))(2×2^(β)) ^(−A(2))(2×2^(β))^(].)

[0013] The matrices ^(A) ⁽¹⁾ ^((2×2) ^(α) ⁾ _(,) and ^(A) ⁽²⁾ ^((2×2) ^(α) ) are used to generate a child node of one of the progenitor nodes. The child node contains the M×N matrix, which is found by iterating the relationship:

^(A(i−1))(O×P)^(=[B(1))(2×2)^({circle over (×)}A(i/2))(O/2×P/2)^(])

^(A(i))(O×P)^(=[B(2))(2×2) ^({circle over (×)}A(i/2))(O/2×P/2)^(],)

[0014] where {circle over (×)} indicates a Kronecker product, and i=2, 4, 6, 8, etc.

[0015] The construction of 2D OVSF codes according to the present invention requires at most two sets of 2×2 orthogonal matrices {A⁽¹⁾(2 × 2),  A⁽²⁾(2 × 2)}

[0016] and {B⁽¹⁾(2 × 2),  B⁽²⁾(2 × 2)}.

[0017] As an example, $\left\{ {{A^{(1)}\left( {2 \times 2} \right)}\quad,{A^{(2)}\left( {2 \times 2} \right)}} \right\} = \left\{ {\begin{bmatrix}  + & + \\  + & -  \end{bmatrix},\begin{bmatrix}  + & - \\  + & +  \end{bmatrix}} \right\}$

[0018] and $\left\{ {{B^{(1)}\left( {2 \times 2} \right)}\quad,{B^{(2)}\left( {2 \times 2} \right)}} \right\} = {\left\{ {\begin{bmatrix}  + & + \\  + & -  \end{bmatrix},\begin{bmatrix}  - & + \\  + & +  \end{bmatrix}} \right\} \quad.}$

[0019] In particular, the two sets of 2×2 orthogonal matrices can be the same. As an example, $\left\{ {{A^{(1)}\left( {2 \times 2} \right)}\quad,{A^{(2)}\left( {2 \times 2} \right)}} \right\} = {\left\{ {{B^{(1)}\left( {2 \times 2} \right)}\quad,{B^{(2)}\left( {2 \times 2} \right)}} \right\} = {\left\{ {\begin{bmatrix}  + & + \\  + & -  \end{bmatrix},\begin{bmatrix}  + & - \\  + & +  \end{bmatrix}} \right\} \quad.}}$

[0020] Construction of 2D OVSF codes can thus be achieved by one set of 2×2 orthogonal matrices. In short, the entire set of 2D OVSF codes according to the present invention can be constructed by any set of 2×2 orthogonal matrices.

[0021] It is an advantage that the present invention provides a new class of 2D-OVSF codes that offers greater variability between the relative dimensions of the columns- and rows of the associated matrices, and hence permits a MC-DS/CDMA system greater flexibility In the choice of the number of carrier frequencies and the spreading factor utilized.

[0022] It is a further advantage of the present invention that the 2D-OVSF codes can be generated recursively by using a tree structure that is analogous to 1D-OVSF codes.

[0023] Similarly, multirate transmissions can be completed by variable-length spreading and multicode techniques when 2D OVSF codes as obtained by the present invention are used in MC-DS/CDMA systems. It is yet another advantage that the present invention 2D-OVSF codes possess zero cyclic auto-correlation and cross-correlation properties. The present invention 2D OVSF codes are thus capable of remaining orthogonal in asynchronous channels, and so a two-layered spreading technique is not necessarily needed.

[0024] These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment, which is illustrated in the various figures and drawings.

BRIEF DESCRIPTION OF DRAWING

[0025]FIG. 1A is a simple block diagram of a multicarrier direct-sequence code-division multiple-access (MC-DS/CDMA) communications system according to the prior art.

[0026]FIG. 1B shows a matrix utilized by the communications system of FIG. 1A.

[0027]FIG. 2 illustrates a portion of a code tree of two-dimensional orthogonal variable spreading factor (2D-OVSF) codes according to the present invention.

[0028]FIGS. 3A to 3D depict initial orthogonal matrices.

[0029]FIGS. 4A and 4B depict matrices associated with progenitor node pairs of the code tree of FIG. 2.

[0030]FIG. 5 shows the Kronecker product of two matrices.

[0031] FIGS. 6A-6D illustrate matrices for 2D-OVSF codes constructed according to the present invention.

[0032]FIGS. 7A and 7B are mode detailed code tree diagrams of the code tree shown in FIG. 2.

DETAILED DESCRIPTION

[0033] Please refer to FIG. 2. FIG. 2 illustrates a portion of a code tree 20 of two-dimensional orthogonal variable spreading factor (2D-OVSF) codes according to the present invention for a multicarrier direct-sequence code-division multiple-access (MC-DS/CDMA) communications system. The highest level of the code tree 22 is composed of progenitor nodes 22. The progenitor nodes 22 are grouped into pairs, such as progenitor node pairs 22 a, 22 b and 22 c. Each progenitor node 22 is the root node of a subsequent binary tree having a plurality of children nodes 24. Each node 22, 24 has an associated matrix for a 2D-OVSF code, which may be generally termed as A^((i))(M×N), where M is the number of rows in the matrix and relates to the number of frequency carriers in the MC-DS/CDMA communications system, and N is the number of columns in the matrix and represents the spreading factor utilized (i.e., the number of chips per data symbol). Each progenitor node 22 is characterized by a corresponding matrix having the generalized form of A^((i))(2×2^(α)), where α is greater than or equal to one. Each pair of progenitor nodes 22, such as the progenitor node pairs 22 a, 22 b and 22 c, share the same value of α. For example, progenitor node pair 22 a contains two progenitor nodes 22 that respectively correspond to the matrices A⁽¹⁾(2×2) and A⁽²⁾(2×2) (which are 2×2 matrices, so that α=1), progenitor node pair 22 b contains two progenitor nodes 22 that respectively correspond to the matrices A⁽¹⁾(2×4) and A⁽²⁾(2×4) (which are 2×4 matrices, so that α=2), progenitor node pair 22 c contains two progenitor nodes 22 that ru respectively correspond to the matrices A⁽¹⁾(2×8) and A⁽²⁾(2×8) (which are 2×8 matrices, so that α=3), etc. The upper limit of α is simply a design choice according to the maximum spreading factor desired of the MC-DS/CDMA communications system. Each child node 24 is characterized by a corresponding matrix having the generalized form of A^((i))(2^(k)×2^(k+α)), where α is the of value of the progenitor node 22 of the child node 24, and k indicates the depth of the child node 24 within the code tree 20. For example, k=2 indicates that the child node 24 is an immediate child node 24 of a progenitor node 22, k=3 indicates that the child node 24 is a grandchild of the progenitor 22, etc. Note that k=1 is actually indicative of the progenitor nodes 22, and not the children nodes 24. For all matrices A^((i))(M×N), the superscript value (i) may range from 1 to M.

[0034] The code tree 20 is simply a convenient way to express the hierarchical nature of the 2D-OVSF codes, and their associated matrices, of the present invention. Generating the code tree 20 really means generating the matrices that are associated with the nodes 22 and 24 of the code tree 20. To generate these matrices, two sets of initial orthogonal binary matrices {A⁽¹⁾(2×2), A⁽²⁾(2×2)} and B⁽¹⁾(2×2), B⁽²⁾ (2×2) are provided, which are preferably Hadamard matrices. In particular, A⁽¹⁾(2×2) is orthogonal to A⁽²⁾(2×2), and B⁽¹⁾(2×2) is orthogonal to B⁽²⁾(2×2). The term “orthogonal” should be clear to those in the art. In particular, though, for general M×N matrices C⁽¹⁾(M×N) and C⁽²⁾(M×N) to be asynchronous orthogonal, the following relationship must be true:

Σ_(k)Σ_(l)(c ⁽¹⁾ _(k,l) c ⁽²⁾ _(k,l)⊕_(t))=0

[0035] In which k sums up from zero to (M−1), I sums up from zero to (N−1), and c^((i))k,l indicates a matrix element in the k^(th) row and l^(th) column in the i^(th) matrix. The subscript “t” indicates an integer time shift, and the symbol “⊕” indicates a modulo-N operation. An example of such a construction is depicted in FIGS. 3A to 3D. The “+” signs within the matrices of FIGS. 3A to 3D indicate a value of “+1”, whereas the “−” signs indicate a value of “−1”. As a particular solution, it is possible for the orthogonal set of matrices {A⁽¹⁾(2×2), A⁽²⁾(2×2)} to be equal to the orthogonal set of matrices B⁽¹⁾(2×2), B⁽²⁾(2×2)}. In the following, for illustrative purposes only, the matrices of FIGS. 3A and 3B are assumed for both sets of orthogonal matrices {A⁽¹⁾(2×2), A²⁾⁽2×2)} and {B⁽¹⁾(×2), B⁽²⁾⁽2×2)}.That is, in the following discussion it is assumed that A⁽¹⁾(2×2)=B⁽¹⁾⁽2×2), and A⁽²⁾⁽2×2)=B²⁾⁽2×2). To obtain the pairs of progenitor nodes 22 (i.e., to obtain the matrices associated with these nodes 22), the following relationship is iterated:

^(A) ⁽¹⁾ (2×2^(1+β))^(=[A) ⁽¹⁾ (2×2^(β)) ^(A) ⁽²⁾ (2×2^(β))^(])  Eqn. 1A

^(A) ⁽²⁾ (2×2^(1+β))^(=[A) ⁽¹⁾ (2×2^(β)) ^(−A) ⁽²⁾ (2×2^(β))^(])  Eqn. 1B

[0036] For example, with β=1 Eqns. 1A and 1B yield A⁽¹⁾(2×4)=[A⁽¹⁾(2×2)A⁽²⁾ (2×2)], which is depicted in FIG. 4A, and A⁽²⁾(2×4)=[A⁽¹⁾(2×2)−A⁽²⁾(2×2)], which is depicted in FIG. 4B. Similarly, β=2 yields A⁽¹⁾⁽2×8)=[A⁽¹⁾(2×4) A⁽²⁾ (2×4)], and A⁽²⁾(2×8)=[A⁽¹⁾(2×4)−A⁽²⁾(2×4)]. Note that a “−A” simply converts every “+” in A to a “−”, and vice versa. That is, as A is a binary matrix, negating A is simply equivalent to performing a logical NOT operation to each item within A. Clearly, by recursively iterating the above relationships of Eqns. 1A and 1B, it is possible to construct matrix pairs ^(A) ⁽¹⁾ (2×2^(α)) and ^(A) ⁽²⁾ (2×2^(α)) having arbitrarily high values of α.

[0037] In the following, the symbol “⊕” is used to indicate a Kronecker product of two matrices. The Kronecker product of two general matrices A and B is shown in FIG. 5. In FIG. 5, matrix A is assumed to be an M×N matrix, consisting of matrix elements “a _(m,n)”. If matrix B is an O×P matrix, then the Kronecker product A. B clearly yields an MO×NP matrix. To obtain successive generations of matrices for children nodes 24 of a progenitor node 22, the following relationships are iterated:

^(A) ^((i−1)) (O×P)^(=[B) ⁽¹⁾ (2×2)^({circle over (×)}A) ^((i/2)) (O/2×P/2)^(])  Eqn. 2A

^(A) ^((i)) (O×P)^(=[B) ⁽²⁾ (2×2)^({circle over (×)}A) ^((i/2)) (O/2×P/2)^(])  Eqn. 2B

[0038] In the above Eqns.2A and 2B, “i” goes as 2, 4, 6, 8, . . . , O. For example, to obtain the matrices A^((i))(4×4), which correspond to first generation children nodes 24 of the progenitor node pair 22 a, Eqns. 2A and 2B are iterated with i=2, and i=4:

A ⁽¹⁾(4×4)=[B ⁽¹⁾(2×2)·A ⁽¹⁾(2×2)], shown in FIG. 6A;

A ⁽²⁾(4×4)=[B ⁽²⁾(2×2)·A ⁽¹⁾(2×2)], shown in FIG. 6B;

A ⁽³⁾(4×4)=[B ⁽¹⁾(2×2)·A ⁽²⁾(2×2)], shown in FIG. 6C; and

A ⁽⁴⁾(4×4)=[B ⁽²⁾(2×2)·A ⁽²⁾(2×2)], shown in FIG. 6D.

[0039] Note that in FIGS. 6A to 6D it is assumed that A⁽¹⁾(2×2)=B⁽¹⁾(2×2) and that A⁽²⁾(2×2)=B⁽²⁾(2×2). FIGS. 6A to 6D are consequently drawn as such, indicating only the matrices A⁽¹⁾(2×2) and A⁽¹⁾(2×2), rather than the matrices B⁽¹⁾(2×2) and B⁽¹⁾(2×2). In a similar vein, the matrices A⁽¹⁾(4×8) are found from Eqns. 2A and 2B by:

A ⁽¹⁾(4×8)=[B ⁽¹⁾(2×2)·A ⁽¹⁾(2×4)],

A ⁽²⁾(4×8)=[B ⁽²⁾(2×2)·A ⁽¹⁾(2×4)],

A ⁽³⁾(4×8)=[B ⁽¹⁾(2×2)·A ⁽²⁾(2×4)],and

A ⁽⁴⁾(4×8)=[B ⁽²⁾(2×2)·A ⁽²⁾(2×4)].

[0040] From the above, it should be clear that eqns. 1A, 1B, 2A and 2B of the present invention enable the construction of 2D-OVSF code matrices that have the form M×N, where M=2^(k) and ^(N=2) ^(h+α) . To find the matrices A⁽¹⁾(M×N) for M and N having particular values of k and α, Eqns. 1A and 1B are first iterated α times to find the corresponding matrices of the progenitor node pairs 22. Eqns. 2A and 2B are then recursively iterated to a code tree 20 depth of k to find the desired A^((i))(M×N) matrices. The recursive nature of matrices with those of their immediate parent nodes 22, 24 is shown in FIGS. 7A and 7B, which are partial trees diagram of the code tree 20 for α=0 and α=1, respectively. FIG. 2-7B, in combination with Eqns. 1A-2B, should make it clear how to construct any A^((i))(M×N) matrix of the present invention.

[0041]FIG. 2 shows the general tree structure 20 of 2D-OVSF codes as provided by the present invention method. FIG. 7A shows a detailed view of such 2D-OVSF codes where M=N, while FIG. 7B depicts a particular class of such codes with M<N, wherein α=1. As indicated previously, the code tree 20 is actually representative of matrices (which are the 2D-OVSF codes) of the form ² ^(k) ^(×2) ^(k+α) . The term “k” may be thought of as the generational class of the matrices, with those matrices having k=1 being termed progenitor matrices, k=2 children matrices, k=3 grandchildren matrices, etc. It is a characteristic of the present invention code tree 20 that codes at the same generational layer (i.e., having the same value of k) are orthogonal. Furthermore, any two codes at different generational layers (i.e., with different values of k) are also orthogonal to each other, unless one is the parent node of another. The term parent means any node 22, 24 in the code tree 20 that is in the path from a node 24 to the progenitor 22 (i.e., root) of that node 24. Similarly, a child of a first node 24 may be any node 24 for which the first node 24 serves as a parent node 24. Such terminology should be familiar to those in the art. For example, with reference to FIG. 7A, the matrices A⁽¹⁾(2×2), A⁽²⁾(4×4), and A⁽³⁾(8×8) are all not orthogonal to each other. Finally, with respect to a MC-DS/CDMA system, codes having a higher value of k and assigned as a signature sequence to a device represent lower data transmission rates than those codes having lower values of k. Hence, a device requiring high data transmission rates should be assigned a code 24 having a lower value of k, whereas a device that can get by with slower data transmission rates should be assigned a code 24 with a higher value of k.

[0042] Please refer to FIG. 8. FIG. 8 is a block diagram of a MC-DS/CDMA-enabled device 50 according to the present invention for use in a provided MC-DS/CDMA system 60. The MC-DS/CDMA device 50 can be a base station or a mobile unit, and includes a standard MC-DS/CDMA module 56 to provide the MC-DS/CDMA capabilities of the device 50. In particular, the MC-DS/CDMA module 56 includes a transceiver 59 for sending and receiving radio signals, a modulation unit 58 for performing modulation and demodulation of transmitted and received signals, respectively; and an encoder/spreader for performing encoding and spreading of transmitted data, and decoding and de-spreading of received data, according to a signature sequence 55 b. The signature sequence 55 b can be represented by a matrix, and is provided by an M×N spreading code matrix generator 52. The M×N spreading code matrix generator 52 generates elements for a matrix 55 a by utilizing the method disclosed above, and will typically include a central processing unit (CPU) 52 c and a memory 52 m. The memory 52 m holds program code 54 that is executed by the CPU 52 c, and which contains instructions for implementing the present invention M×N spreading code matrix generation method. The form of both the CPU 52 c and the corresponding program code 54 is a design choice, and construction of the program code 54 should be a simple matter for a reasonably skilled programmer based upon the above disclosure. How matrices are represented internally within the memory 52 m is also clearly a design choice. In particular, that the program code must contain at least the first set of orthogonal 2×2 matrices {A⁽¹⁾(2×2), A⁽²⁾(2×2)}. It is certainly possible for the first set of orthogonal 2×2 matrices{A⁽¹⁾(2×2), A⁽²⁾(2×2)} to also serve as the second set of orthogonal 2×2 matrices {B⁽¹⁾(2×2), B⁽²⁾(2×2)}. The program code 54 may either initially generate a portion of the code tree 20 for storage in the memory 52 m and then select a node 22, 24 for the matrix 55 a, or may simply generate a single matrix 55 a on the fly according to a set of given parameters. The matrix 55 a is then passed to the MC-DS/CDMA module 56 to serve as the signature sequence 55 b of the device 50. The program code 54 can provide the matrix 55 a having the generalized form of ^(A(i))(2^(k)×2 ^(k+α)) , as discussed above, according to the parameters i, k and α. Appropriate selection of the parameters i, k and α, however, is extremely important for the overall functioning of the MC-DS/CDMA system 60, the details of which are beyond the scope of this invention. In general, however, it is necessary for every device in the MC-DS/CDMA system 60, including the device 50, to have orthogonal spreading code matrices (as represented by the nodes 22, 24). As the code tree 20 is common to all devices within the MC-DS/CDMA system 60, the signature sequence 55 b generated by the matrix generator 52 should be one that is not a child node 24 of any already-assigned node 22, 24. Further, the tree-like structure 20 of spreading codes of the present invention makes it possible to take data transmission rate requirements of the device 50 into consideration. If the device 50 has low data rate requirements, codes 24 with high k values can be assigned, with the caveat that a greater number of such devices 50 can be simultaneously supported by the MC-DS/CDMA system 60, as a greater number of such orthogonal high-k codes 24 are available to the system 60. Similarly, if the device 50 has high data rate requirements, such as streaming video or the like, then the device 50 should be assigned a signature sequence 55 b with a lower value of k, with the corresponding caveat that fewer such devices 50 can be simultaneously supported by the MC-DS/CDMA system 60, as all the children codes 24 of such an assigned code 22, 24 are no longer available to the system 60 for assignment to a device. Because of the truly orthogonal nature of the codes 22, 24 provided by the present invention, a two-layered spreading scheme is no longer required, while, due to the tree-like structure of the codes 22, 24, multirate transmissions are intrinsically supported.

[0043] With respect to the above, it is generally a base station that will assign a signature sequence to a mobile unit (typically termed “user equipment”, or simply “UE”). In this case, it is not necessary for the UE to generate the signature sequence. Instead, the base station can generate the appropriate signature sequence for a UE, and then transmit the signature sequence to the UE, which the UE then adopts for its signature sequence.

[0044] In contrast to the prior art, the present Invention provides a method for generating a code tree of spreading codes that are truly orthogonal, and which supports multirate transmission capabilities. The 2D-OVSF spreading codes of the present invention are of a generalized ² ^(k) ^(×2) ^(k+α) form, with k greater than or equal to one, and α greater than or equal to zero. Hence, the prior art limitations of having only M×M or M×M² matrices is removed, providing a corresponding increase to flexibility as regards MC-DS/CDMA systems. The present invention 2D-OVDF codes can be utilized in MC-DS/CDMA systems to support wireless devices at a variety of data rates.

[0045] Those skilled in the art will readily observe that numerous modifications and alterations of the device may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims. 

What is claimed is:
 1. A method for wireless communications comprising: providing a multicarrier direct-sequence code-division multiple-access (MS-DS/CDMA) communications system; generating a code tree of two-dimensional orthogonal variable spreading factor (2D-OVSF) codes, wherein each node of the code tree has a corresponding matrix; selecting an M×N matrix from a node of the code tree, where M relates to the number of available frequency carriers in the MS-DS/CDMA system, N relates to a spreading factor, M=2^(k),^(N=2) ^(h+α) , k is greater than zero, and α is greater than or equal to zero; and assigning the M×N matrix to a MS-DS/CDMA-enabled device of the MS-DS/CDMA system to serve as a signature sequence of the device; wherein generating the code tree comprises: providing a first set of orthogonal 2×2 matrices {A_((2 × 2))⁽¹⁾, A_((2 × 2))⁽²⁾};  

providing a second set of orthogonal 2×2 matrices   {B_((2 × 2))⁽¹⁾, B_((2 × 2))⁽²⁾};  

utilizing the first set of 2×2 matrices to generate a pair of progenitor nodes in the code tree that respectively represent matrices ^(A) ⁽¹⁾ (2×2^(α)) and ^(A) ⁽²⁾(2×2^(α)) by iterating the relationship: $\begin{matrix} {{{A^{(1)}\left\{ {2 \times 2^{i + 1}} \right\}} = \left\lbrack {R^{(1)}\left\{ {2 \times 2^{i}} \right\} A^{(2)}\left\{ {2 \times 2^{i}} \right\}} \right\rbrack},} \\ {{{A^{(2)}\left\{ {2 \times 2^{i + 1}} \right\}} = \left\lbrack {{A^{(1)}\left\{ {2 \times 2^{i}} \right\}} - {A^{(2)}\left\{ {2 \times 2^{i}} \right\}}} \right\rbrack};} \end{matrix}$

utilizing the matrices ^(A) ⁽¹⁾ (2×2^(α)) and ^(A) ⁽²⁾ (2×2^(α)) to generate a child node of one of the progenitor nodes, the child node having the M×N matrix, by iterating the relationship: ^(A) ^((i−1)) (O×P)^(=[B) ⁽¹⁾ (2×2)^({circle over (×)}A) ^((i/2)) (O/2×P/2)^(],) ^(A) ^((i)) (O×P)^(=[B) ⁽²⁾ (×2)^({circle over (×)}A) ^((i/2)) (O/2×P/2)^(];) wherein {circle over (×)} is a Kronecker product.
 2. The method of claim 1 wherein children nodes of the code tree correspond to data transmission rates that are slower than those of parent nodes, thereby enabling multirate transmissions by utilizing orthogonal matrices in the code tree.
 3. The method of claim 1 wherein children nodes of the progenitor nodes are in the form of a binary tree.
 4. The method of claim 1 wherein α is greater than zero.
 5. The method of claim 1 wherein the first set of orthogonal 2×2 matrices is identical to the second set of orthogonal 2×2 matrices.
 6. The method of claim 1 wherein any two matrices at an identical layer in the code tree are orthogonal to each other, and any two matrices at different layers in the code tree are orthogonal if and only if one of the matrices is not the parent code of the other matrix.
 7. A wireless communications device comprising: a multicarrier direct-sequence code-division multiple-access (MS-DS/CDMA) module for providing MC-DS/CDMA functionality to the wireless device according to a signature sequence; and an M×N matrix generator for generating a two-dimensional orthogonal variable spreading factor (2D-OVSF) code to serve as the signature sequence, where M relates to the number of available frequency carriers available to the wireless device, N relates to a spreading factor, M=2^(k),^(N=2) ^(h+α) , k is greater than zero, and α is greater than or equal to zero, the M×N matrix generator providing: a first set of orthogonal 2×2 matrices {A_((2 × 2))⁽¹⁾, A_((2 × 2))⁽²⁾};  

and a second set of orthogonal 2×2 matrices {B_((2 × 2))⁽¹⁾, B_((2 × 2))⁽²⁾}

the M×N matrix generator performing the following steps to generate the signature sequence: utilizing the first and second 2×2 matrices to generate a progenitor matrix ^(A) ⁽¹⁾ (2×2^(α)) or ^(A) ⁽²⁾ (2×2^(α)) by iterating the relationship: ^(A(1))(2×2^(1+β))^(=[A(1))(2×2^(β)) ^(A(2))2×2^(β))^(],) ^(A(2))(2×2^(1+β))^(=[A(1))(2×2^(β)) ^(−A(2))(2×2^(β))^(].) utilizing the matrix A⁽¹⁾(2×2^(α)) or A⁽²⁾(2×2^(α)) to generate an M×N matrix by iterating the relationship: ^(A) ^((i−1)) (O×P)^(=[B) ⁽¹⁾ (2×2)^({circle over (×)}A) ^((i/2)) (O/2×P/2)^(],) ^(A) ^((i)) (O/2×P/2)^(=[B) ⁽²⁾ (2×2)^({circle over (×)}A) ^((i/2)) (O/2×P/2)^(];) wherein {circle over (×)} is a Kronecker product.
 8. The wireless device of claim 7 wherein the M×N matrix generator comprises a central processing unit (CPU) and memory, the memory storing the first set of orthogonal 2×2 matrices {A⁽¹⁾(2×2), A⁽²⁾(2×2)}, the second set of orthogonal 2×2 matrices{B⁽¹⁾(2×2), B⁽²⁾(2×2)}, and program code executable by the CPU to perform the steps to generate the signature sequence.
 9. The wireless device of claim 7 wherein α is greater than zero.
 10. The wireless device of claim 7 wherein the first set of orthogonal 2×2 matrices is identical to the second set of orthogonal 2×2 matrices.
 10. The wireless device of claim 7 wherein the first set of orthogonal 2×2 matrices is identical to the second set of orthogonal 2×2 matrices.
 11. A wireless communications device comprising: a multicarrier direct-sequence code-division multiple-access (MS-DS/CDMA) module for providing MC-DS/CDMA functionality to the wireless device according to a signature sequence; and a memory for storing a code tree of two-dimensional orthogonal variable spreading factor (2D-OVSF) codes that are capable of serving as the signature sequence, the 2D-OVSF codes each expressible as an M×N matrix A⁽¹⁾(M×N) in which M relates to the number of available frequency carriers available to the wireless device, N relates to a spreading factor, M=2^(k), ^(N=2) ^(k+α) , k is greater than zero, i ranges from one to M, and α is greater than or equal to zero, the 2D-OVSF codes of the code tree being interrelated by: $\begin{matrix} \begin{matrix} \begin{matrix} {{{A^{(1)}\left( {2 \times 2^{i + 1}} \right)} = \left\lbrack {{A^{(1)}\left( {2 \times 2^{i}} \right)}{A^{(2)}\left( {2 \times 2^{i}} \right)}} \right\rbrack},} \\ {{{A^{(2)}\left( {2 \times 2^{i + 1}} \right)} = \left\lbrack {{A^{(1)}\left( {2 \times 2^{i}} \right)} - {A^{(2)}\left( {2 \times 2^{i}} \right)}} \right\rbrack},} \end{matrix} \\ {{A_{({0 \times P})}^{({i - 1})} = \left\lbrack {B_{({2 \times 2})}^{(1)} \otimes A_{({{0/2} \times {P/2}})}^{({i/2})}} \right\rbrack},{and}} \end{matrix} \\ {{A_{({0 \times P})}^{(i)} = \left\lbrack {B_{({2 \times 2})}^{(2)} \otimes A_{({{0/2} \times {P/2}})}^{({i/2})}} \right\rbrack},} \end{matrix}$

wherein {circle over (×)} is a Kronecker product, A⁽¹⁾(2×2) is orthogonal to A⁽²⁾(2×2), and B⁽¹⁾(2×2) is orthogonal to B⁽²⁾(2×2).
 12. The wireless device of claim 11 wherein α is greater than zero.
 13. The wireless device of claim 11 wherein A⁽¹⁾(2×2) equals B⁽¹⁾(2×2), and A⁽²⁾(2×2) equals B⁽²⁾(2×2).
 14. A method for providing a signature sequence to a mobile unit in a multicarrier direct-sequence code-division multiple-access (MS-DS/CDMA) communications system, the method comprising: a base station generating an M×N matrix according to a matrix generation method; the base station transmitting the M×N matrix to a mobile device; and the mobile device utilizing the M×N matrix to serve as a signature sequence of the mobile device; wherein the matrix generation method comprises: providing a first set of orthogonal 2×2 matrices {A⁽¹⁾(2×2), A⁽²⁾(2×2)}; providing a second set of orthogonal 2×2 matrices {B⁽¹⁾(2×2), B⁽²⁾(2×2)}; utilizing the first set of 2×2 matrices to generate a pair of progenitor nodes in a code tree that respectively represent matrices ^(A) ⁽¹⁾ (2×2^(α)) and ^(A) ⁽²⁾ (2×2^(α)) by iterating the relationship: ^(A) ⁽¹⁾ (2×2^(1+β))^(=[A) ⁽¹⁾ (2×2^(β)) ^(A) ⁽²⁾ (2×2^(β))^(],) ^(A) ⁽²⁾ (2×2^(1+β))^(=[A) ⁽¹⁾ (2×2^(β)) ^(−A) ⁽²⁾ (2×2^(β))^(]; and) utilizing the matrices ^(A) ⁽¹⁾ (2×2^(α)) and ^(A) ⁽²⁾ (2×2^(α)) to generate a child node of one of the progenitor nodes, the child node having the M×N matrix, by iterating the relationship: ^(A) ^((i−1)) (O×P)^(=[B) ⁽¹⁾ (2×2) ^({circle over (×)}A) ^((i/2)) (O/2×P/2)^(],) ^(A) ^((i)) (O×P)^(=[B) ⁽²⁾ (2×2) ^({circle over (×)}A) ^((i/2)) (O/2×P/2)^(];) wherein {circle over (×)} is a Kronecker product.
 15. The method of claim 14 wherein children nodes of the code tree correspond to data transmission rates that are slower than those of parent nodes, thereby enabling multirate transmissions by utilizing orthogonal matrices in the code tree.
 17. The method of claim 14 wherein α is greater than zero.
 18. The method of claim 14 wherein the first set of orthogonal 2×2 matrices is identical to the second set of orthogonal 2×2 matrices.
 19. The method of claim 14 wherein any two matrices at an identical layer in the code tree are orthogonal to each other, and any two matrices at different layers in the code tree are orthogonal if and only if one of the matrices is not the parent code of the other matrix.
 20. A method for providing a signature sequence to a mobile unit in a multicarrier direct-sequence code-division multiple-access (MS-DS/CDMA) communications system, the method comprising: a base station generating an M×N matrix according to a matrix generation method; the base station transmitting the M×N matrix to a mobile device; and the mobile device utilizing the M×N matrix to serve as a signature sequence of the mobile device; wherein the matrix generation method comprises: providing a first set of orthogonal ^(2×2) ^(α) matrices ^(A) ⁽¹⁾ (2×2^(α)) and ^(A) ⁽²⁾ (2×2^(α)); providing a second set of orthogonal 2×2 matrices {B⁽¹⁾(2×2), B⁽²⁾(2×2)}; and utilizing the matrices ^(A) ⁽¹⁾ (2×2^(α)) and ^(A) ⁽²⁾⁽ 2×2^(α)) to generate the M×N matrix by iterating the relationship: ^(A) ^((i−1)) (O×P)^(=[B) ⁽¹⁾ (2×2)^({circle over (×)}A) ^((i/2)) (O/2×P/2)^(],) ^(A) ^((i)) (O×P)^(=[B) ⁽²⁾ (2×2)^({circle over (×)}A) ^((i/2)) (O/2×P/2)^(];) wherein {circle over (×)} is a Kronecker product.
 21. The method of claim 20 wherein α is greater than zero. 